Counterexamples to the interpolating conjecture on partial-dual genus polynomials of ribbon graphs
نویسندگان
چکیده
Gross, Mansour and Tucker introduced the partial-dual orientable genus polynomial Euler polynomial. They showed that for an ribbon graph is interpolating gave analogous conjecture: The Euler-genus any non-orientable interpolating. In this paper, we first give some counterexamples to conjecture. Then motivated by these counterexamples, further find two infinite classes of counterexamples.
منابع مشابه
Counterexamples of the Conjecture on Roots of Ehrhart Polynomials
An outstanding conjecture on roots of Ehrhart polynomials says that all roots α of the Ehrhart polynomial of an integral convex polytope of dimension d satisfy −d ≤ R(α) ≤ d − 1. In this paper, we suggest some counterexamples of this conjecture.
متن کاملDual equivalence graphs, ribbon tableaux and Macdonald polynomials
We make a systematic study of a new combinatorial construction called a dual equivalence graph. Motivated by the dual equivalence relation on standard Young tableaux introduced by Haiman, we axiomatize such constructions and prove that the generating functions of these graphs are Schur positive. We construct a graph on k-ribbon tableaux which we conjecture to be a dual equivalence graph, and we...
متن کاملSynopsis: Dual Equivalence Graphs, Ribbon Tableaux and Macdonald Polynomials
The primary focus of this dissertation is symmetric function theory. The main objectives are to present a new combinatorial construction which may be used to establish the symmetry and Schur positivity of a function expressed in terms of monomials, and to use this method to find a combinatorial description of the Schur expansion for two important classes of symmetric functions, namely LLT and M...
متن کاملIndependence polynomials of well-covered graphs: Generic counterexamples for the unimodality conjecture
A graph G is well-covered if all its maximal stable sets have the same size, denoted by α(G) (M. D. Plummer, 1970). If sk denotes the number of stable sets of cardinality k in graph G, and α(G) is the size of a maximum stable set, then I(G;x) = α(G) ∑ k=0 skx k is the independence polynomial of G (I. Gutman and F. Harary, 1983). J. I. Brown, K. Dilcher and R. J. Nowakowski (2000) conjectured th...
متن کاملOn counterexamples to the Hughes conjecture
In 1957 D.R. Hughes published the following problem in group theory. Let G be a group and p a prime. Define Hp(G) to be the subgroup of G generated by all the elements of G which do not have order p . Is the following conjecture true: either Hp(G) = 1, Hp(G) = G , or [G : Hp(G)] = p? This conjecture has become known as the Hughes conjecture. After various classes of groups were shown to satisfy...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Combinatorics
سال: 2022
ISSN: ['1095-9971', '0195-6698']
DOI: https://doi.org/10.1016/j.ejc.2021.103493